Dynamic data compression selection

ABSTRACT

Aspects of dynamic data compression selection are presented. In an example method, as uncompressed data chunks of a data stream are compressed, at least one performance factor affecting selection of one of multiple compression algorithms for the uncompressed data chunks of the data stream may be determined. Each of the multiple compression algorithms may facilitate a different expected compression ratio. One of the multiple compression algorithms may be selected separately for each uncompressed data chunk of the data stream based on the at least one performance factor. Each uncompressed data chunk may be compressed using the selected one of the multiple compression algorithms for the uncompressed data chunk.

CROSS REFERENCE TO RELATED APPLICATIONS

This is a continuation of U.S. non-provisional application Ser. No.15/181,788, filed Jun. 14, 2016, which is a continuation of U.S.non-provisional application Ser. No. 14/641,079, filed on Mar. 6, 2015,the entire disclosures of which are herein incorporated by reference forall purposes.

TECHNICAL FIELD

Aspects of the present disclosure relate generally to data compressiontechnology and, more specifically, to dynamic data compressionselection.

BACKGROUND

As the term suggests, data compression involves the compressing, orreduction in size, of data. Consequently, data compression typicallyresults in a reduction in the amount of communication bandwidth consumedwhen the compressed data is transferred over a communication network orconnection. In some examples, data compression may be “lossless,” inwhich the original pre-compression data may be completely reconstructedfrom the compressed data. In other implementations, the data compressionmay be “lossy,” in which the original data may not be reconstructedcompletely or perfectly. Lossy data compression is often employed inapplications, such as audio compression or image compression, in whichperfect reproduction of the original data is unimportant for theexpected use of that data. In other examples, such as remote replicationof data for disaster recovery and similar backup purposes, applicationsoften employ lossless compression so that all of the compressed data maybe reproduced in its original form for subsequent use by the enterpriseor other entity relying on the presence of that data.

In the example of remote replication and other data backup-and-restorefunctions, the data to be saved is often compressed at the data sourceand subsequently transmitted over a network to a data target that isgeographically remote from the source so that the data may betransmitted more quickly over the network (both from the data source tothe target and vice-versa). The remote storing of the data is oftendesirable for disaster recovery, as a single disaster is unlikely toaffect the data at both the local and the remote locations. Oftentimes,an operator of the data source manually determines whether a particularset or stream of data to be replicated is to be compressed prior totransmission. The operator may make such a determination based on anynumber of static factors, such as the amount of data to be replicatedand the relative importance of the data.

It is with these observations in mind, among others, that aspects of thepresent disclosure were conceived.

SUMMARY

Aspects of the present disclosure involve a system for data compressionemploying dynamic compression selection. The system may include aperformance monitor, a compression selection module, and a compressionmodule. The performance monitor may determine, as uncompressed datachunks of a data stream are compressed, at least one performance factoraffecting selection of one of multiple compression algorithms for theuncompressed data chunks of the data stream, in which each of themultiple algorithms facilitates a different expected compression ratio.The compression selection module may select separately, for eachuncompressed data chunk, one of the algorithms based on the performancefactor. The compression module may compress each uncompressed data chunkusing the selected algorithm for the uncompressed data chunk. Otherpotential aspects of the present disclosure are described in greaterdetail below.

BRIEF DESCRIPTION OF THE DRAWINGS

Exemplary embodiments are illustrated in referenced figures of thedrawings. It is intended that the embodiments and figures disclosedherein are to be considered illustrative rather than limiting. The useof the same reference numerals in different drawings indicates similaror identical items.

FIG. 1 is a block diagram of an example data source and data target, inwhich the data source includes a data compression system employingdynamic data compression algorithm selection;

FIG. 2 is a flow diagram of an example method of dynamic datacompression algorithm selection;

FIG. 3 is a flow diagram of another example method of dynamic datacompression algorithm selection;

FIG. 4A is a block diagram of an example network queue employed in adata source to determine a performance factor for an example method ofdynamic data compression algorithm selection;

FIG. 4B is a block diagram of an example network queue employed in adata target;

FIGS. 4C and 4D are a flow diagram of an example method of operating thedata source of FIGS. 1 and 4A;

FIGS. 4E and 4F are a flow diagram of an example method of operating thedata target of FIGS. 1 and 4B;

FIG. 5 is a block diagram of an example execution thread pool employedin a data source to determine a performance factor for an example methodof dynamic data compression algorithm selection;

FIG. 6 is a block diagram of multiple threads assigned to compress dataof a single data stream for transmission over a high-throughput networkconnection;

FIG. 7 is a block diagram of multiple threads assigned to compress dataof a single data stream for transmission over a low-throughput networkconnection;

FIG. 8 is a block diagram of multiple threads assigned to compress dataof two data streams for transmission over high-throughput networkconnections;

FIG. 9 is a block diagram of multiple threads assigned to compress dataof two data streams for transmission over a high-throughput networkconnection and a low-throughput network connection; and

FIG. 10 is a block diagram illustrating an example of a computing systemwhich may be used in implementing embodiments of the present disclosure.

DETAILED DESCRIPTION

In at least some embodiments described below, a system for dynamic datacompression selection may select one of multiple data compressionalgorithms for each uncompressed data chunk of a data stream based on atleast one performance factor, and then compress each data chunk usingthe selected data compression algorithm for that data chunk. Dynamicallyselecting the type of data compression for each chunk of the data streamthus may allow the system to adapt to changing conditions in theoperational environment of a source of the data stream, and may relievean operator of the source from the administrative task of manuallyenabling and disabling data compression, which is unlikely to allow theoperator to react quickly to the changing conditions. These and otherpotential advantages will be recognized from the discussion set outherein.

FIG. 1 is a block diagram of an example data source 110 including a datacompression system 120 employing dynamic data compression algorithmselection, along with a corresponding data target 160. The datacompression system 120 may be configured to retrieve or receive sourcedata 142 from local data storage 130, compress the source data 142 toyield compressed target data 144, and transmit the target data 144 via anetwork interface 132 over a network 150 or communication connection toremote data storage 180 of the data target 160. In at least someexamples, the data compression system 120 may monitor at least oneperformance factor, such as one or more factors involving the datasource 110, the network 150, or the data target 160, and select aparticular data compression algorithm, or particular parameters for adata compression algorithm, for each individual portion of the sourcedata 142. Each of the available compression algorithms may provide orfacilitate a different expected compression ratio for the resultingcompressed data.

The source data 142 may be, for example, any data that a user, owner, oroperator causes to be compressed and subsequently transferred forstorage at some other, possibly remote, location. Examples of the sourcedata 142 may include, but are not limited to, financial data, employeedata, sales and marketing data, product data, engineering data,technical specifications, image data, audio/video data, and the like.Also, as is described in greater detail below, the source data 142 maybe retrieved by, or provided to, the data compression system 120 as oneor more individual data streams, each of which be segmented intomultiple data “chunks” for compression. Further, the data compressionsystem 120 may process the data streams, as well as the individualchunks of one or more data streams, concurrently or simultaneously byway of multiple software processes and/or execution threads operatingwithin the data source 110. In an example, each data stream may includeone or more data files, data file folders, or some other data containeror structure.

In one example, the data source 110 may be a client or customer computersystem that includes or accesses the source data 142 stored at the localdata storage 130. The local data storage 130 may include hard disk drivestorage, flash-based data storage, optical drive storage, or any othertype of data storage media. While the particular example of FIG. 1depicts the local data storage 130 as residing within the data source100, the local data storage 130 may be located external to the datasource 110 in some examples, with the data source 110 accessing thelocal data storage 130 by way of a communication connection or network,such as, for example, a wide area network (WAN) (e.g., the Internet) ora local area network (LAN) (e.g., an Ethernet or Wi-Fi® connection), orany other connection usable for communicatively coupling a computer todata storage.

The data target 160 may be, in an example, any computer or computingsystem configured to receive the target data 144 via the network 150 orsimilar communication connection. In some examples, the data target 160may be any kind of data server or data storage system, such as a fileserver, file system, logical volume manager, and so on. In a particularembodiment, the data target may be a ZFS® combined file system/logicalvolume manager provided by Oracle Corporation of Redwood City, Calif.Also, as with the local data storage 130, the remote data storage 180may include hard disk drive storage, flash-based data storage, opticaldrive storage, or any other type of data storage media, and may beeither incorporated within the data target 160, or accessible by thedata target 160 via a network or other communication network.

The network 150 may be any communication network or connection (e.g., aWAN, LAN, cellular data network, or the like) over which the target data144 may be transferred between the data source 110 and the data target160. Accordingly, the network interface 132 of the data source 110 maybe any interface that communicatively couples the data source 110 to thecommunication connection or network 150 so that the target data 144 maybe transmitted to the data target 160 via the network 150.

As illustrated in FIG. 1, the data compression system 120 of the datasource 110 may include a performance monitor 122, a compressionselection module 124, a compression module 126, and/or a threadassignment module 128. The data compression system 120 may include othermodules or components not explicitly depicted in FIG. 1, but suchmodules or components are not discussed further herein to simplify andfocus the following discussion. Similarly, the data source 110 mayinclude other components or modules, such as, for example, a userinterface, a power supply, and so on, but such components are notdescribed further herein for simplicity. Additionally, the data target160 may also include corresponding versions of at least some of themodules or components of the data source 110, such as, for example, aperformance monitor 172, a decompression module 176, and a threadassignment module 178 of a data decompression system 170, as well as anetwork interface 182. Such modules would facilitate reception of thetarget data 144 from the network 150 via the network interface 182, anddecompression of the target data 144 by the data decompression system170 before storage of the data as decompressed store data 146 at theremote data storage 180. In yet other examples, some systems may beemployed as both a data source 110 and a data target 160, thus possiblyincorporating the modules corresponding to both the data source 110 andthe data target 160, as described herein.

Each of the performance monitor 122, the compression selection module124, the compression module 126, and the thread assignment module 128 inthe data compression system 120 of the data source 110 may beimplemented in an example by way of one or more processors executing asoftware application, process, thread, service, or other mechanism toperform the various tasks or operations ascribed to each of the modules122-128 discussed herein. In other examples, one or more of the modules122-128 may be hardware components or circuits (e.g.,application-specific integrated circuits (ASICs) or field-programmablegate arrays (FPGAs)), or some combination of hardware, firmware, and/orsoftware components. The modules 172, 176, and 178 in the datadecompression system 170 of the data target 160 may be similarlyimplemented, and operate in a corresponding fashion to, thecorresponding modules 122, 126, and 128 in the data compression system120 of the data source 110.

The performance monitor 122 of the data compression system 120 may beconfigured to determine at least one performance factor affectingselection of one of multiple compression algorithms for compressinguncompressed data chunks of a data stream. In one example, theperformance monitor 122 may determine the at least one performancefactor periodically or repeatedly so that a new selection of theparticular compression algorithm to be used may be performed on aper-chunk basis, or once every multiple number of chunks. In oneexample, the size of a data chunk may be on the order of one megabyte (1MB), but smaller or larger sizes for the data chunk may be utilized inother embodiments. Examples of the at least one performance factor to bemonitored may include, but are not limited to, a compression ratio of atleast one previously compressed data chunk of the data stream, a currentnetwork throughput associated with the data stream, and a currentprocessor utilization of the data source 110.

The compression selection module 124 may be configured to select one ofthe multiple compression algorithms for the uncompressed data chunks ofthe data stream based on the at least one performance factor. In oneexample, the compression selection module 124 may make a separatecompression algorithm selection for each uncompressed data chunk to becompressed. Consequently, the compression algorithms to be employed incompressing the data stream may be changed as often as once per chunk ofthe data stream to react to changing conditions at the data source 110,the network 150, and/or the data target 160. In other examples, thecompression selection module 124 may select a particular algorithm foreach set of multiple chunks (e.g., each set of two chunks, each set ofthree chunks, and so on) of the data stream.

The compression module 126 may be configured to perform the compressionon the data chunks using the compression algorithms selected by thecompression selection module 124. In examples in which the compressionselection module 124 selects one of the compression algorithms for eachdata chunk of the data stream, the compression module 126 may compresseach data chunk using the selected algorithm for the corresponding datachunk. In other embodiments, the compression module 126 may apply aparticular algorithm to each set of chunks for which the compressionselection module 124 has selected that algorithm. Depending on theparticular embodiment, the compression selection module 124 or thecompression module 126 may generate an indication of the particularselected compression algorithm for compressing each data chunk toaccompany its associated data chunk so that the decompression module 176in the data decompression system 170 of the data target 160 may use theappropriate decompression algorithm to decompress the data chunk priorto storage in the remote data storage 180.

The thread assignment module 128, in some embodiments, may be configuredto assign and/or apportion available execution threads in the datasource 110, such as from a shared thread pool, to one or more datastreams to compress the data chunks using the compression module 126. Inat least some examples, the thread assignment module 128 may perform thethread assignment based on the fullness or emptiness of network queuesof the network interface 132. This functionality of the threadassignment module 128 is discussed in greater detail below inconjunction with FIGS. 6-9. Further, the thread assignment module 178 inthe data decompression system 170 of the data target 160 may employ oneor more execution threads from a shared thread pool to decompress thereceived data chunks using the decompression module 176 in a similarmanner.

FIG. 2 is a flow diagram of an example method 200 of dynamic datacompression algorithm selection. In the following description, themethod 200 is presumed to be performed by the data source 110 and thedata compression system 120 of FIG. 1. However, other systems or devicesnot specifically described herein may perform the method 200 in otherembodiments.

In the method 200, at least one performance factor affecting selectionof one of a plurality of compression algorithms is determined (operation202). The one or more performance factors may include, but are notlimited to, a compression ratio of one or more previously compresseddata chunks of the data stream, a current network throughputcorresponding to the data stream, and a current processor utilization ofthe data source 110. For example, the compression ratio of a mostrecently compressed data chunk may be determined by comparing thepre-compression length or size of the chunk (e.g., in bytes) against thepost-compression length of that chunk to determine the overallcompression ratio associated with the compressed chunk.

In other examples, the performance monitor 122 may determine or measureone or more of the performance factors indirectly, as opposed tomeasuring directly the particular factor or metric. For example, adepth, fullness, or emptiness of a buffer or queue within the datasource 110, or an amount, number, or percentage of a particular resourcethat is available or unavailable within the data source 110, may serveas a proxy or indirect indication of a particular performance factor, asis discussed in greater detail below in connection with FIGS. 4 and 5.

In some embodiments, the performance monitor 122 may determine one ormore of the performance factors relative to the data chunks to becompressed, such as once per data chunk of a data stream, once per setof multiple data chunks of a data stream, or over some other interval ofdata chunks. In other examples, the performance monitor 122 maydetermine one or more of the performance factors periodically, such asonce every few hundred microseconds, once every millisecond or multiplemilliseconds, and so on. Also, in scenarios in which multiple datastreams are to be compressed concurrently or simultaneously, theperformance monitor 122 may monitor one or more of the performancefactors relative to the particular data stream being processed, and maymonitor one or more other factors across the data source 110 as a whole.For example, the performance monitor 122 may measure a separate datachunk compression ratio and a network throughput separately for eachdata stream, but may employ a single measurement of the processorutilization for all of the data streams.

Further in the method 200, one of the multiple compression algorithmsmay be selected for each data chunk, or set of data chunks, of a datastream based on the at least one performance factor (operation 204). Insome examples, the multiple compression algorithms may be completelydifferent algorithms performing compression using vastly differentmethods. In other embodiments, two or more of the compression algorithmsmay be the same basic compression algorithm being configured withdifferent parameters or values upon which one or more portions of thealgorithm are based.

In some embodiments, the compression selection module 124 may compareone or more of the performance factors to corresponding thresholds orlevels to determine which of the compression algorithms to select.Further, whether a particular performance factor has exceeded aparticular threshold may represent a logic state of a variable in aBoolean equation, within which other logic states corresponding to otherperformance factors may be related, such as by way of AND or ORoperators, to determine whether a particular compression is selected. Inexamples in which two compression algorithms are available, such aBoolean equation may indicate which algorithm is to be employed for thecurrent data chunk based on whether the equation evaluates to TRUE orFALSE in light of the current performance factors. In embodiments inwhich more than two compression algorithms are available, multiplethresholds may be employed for one or more of the performance factors,resulting in a multi-bit state for each performance factor, with eachstate being employed in more than one Boolean equation to produce amulti-bit output indicating which of the multiple compression algorithmsto be employed for the current data chunk. In yet other examples, thevalues of the various performance factors may be employed in amathematical equation that produces a numeric value that may then becompared to one or more thresholds in order to determine which of two ormore compression algorithms may be utilized to compress the current datachunk.

The compression selection module 124, in some embodiments, may utilizeother information in addition to the performance factors in making thealgorithm selection. For example, in order to interpret the compressionratio of a previously compressed data chunk, the compression selectionmodule 124 may take into account the particular compression algorithmthat was employed to compress that chunk. The compression selectionmodule 124 or the compression module 126 may store that information withthe chunk or at another memory location. In one implementation, thecompression selection module 124 may select a particular threshold froma plurality of such thresholds based on the particular compressionalgorithm that was employed to compress the chunk to compare against thecompression ratio for that chunk because the amount of compressionattained may be affected to at least some degree by the particularcompression algorithm that was utilized.

Once a particular compression algorithm has been selected for a datachunk or set of data chunks, the one or more chunks may be compressedusing the selected algorithm (operation 206) prior to transfer of thecompressed chunk to the data target 160, as described earlier.

While the operations 202-206 are depicted as operations performed in aparticular sequence, the operations 202-206 of FIG. 2, as well as othermethod operations described herein, may be performed in other orders ofexecution, including in a parallel, overlapping, or concurrent manner.For example, the operations 202-206 of FIG. 2 may be performed as partof a pipelined operation structure in which the operations 202-206 areperformed repeatedly or continually for each data chunk of a data streamto be compressed. In addition, each of the operations 202-206 may beperformed for each of multiple data streams that are to be compressedconcurrently or simultaneously.

FIG. 3 is a flow diagram of another example method 300 of dynamic datacompression algorithm selection. In this particular example, twocompression algorithms are available: a “best compression” algorithmthat may provide a relatively high compression ratio, and a “best speed”algorithm that may provide a relatively low compression ratio comparedto the best compression algorithm, but may perform its compressionsignificantly faster than the best compression algorithm for the samechunk of data. In a particular example, the best compression algorithmmay be the GZIP-1 lossless data compression algorithm associated withthe GNU Project, and the best speed algorithm may be the LZJB (LempelZiv Jeff Bonwick) lossless data compression algorithm often identifiedwith the ZFS® file system. However, other compression algorithms,including possibly lossy algorithms in some applications, may beemployed in other embodiments.

In the method 300, several performance factors may be determined foreach uncompressed data chunk (operation 302). More specifically, aresulting compression ratio of one or more previously compressed datachunks may be determined (operation 304). In this example, theperformance monitor 122 may determine the compression ratio of the datachunk that immediately precedes the current data chunk in the datastream. In other examples, the performance monitor 122 may determine thecompression ratio of the next previous data chunk, or an average ofcompression ratios of the most recent compressed data chunks for whichsuch information is available. Also in this particular embodiment, eachdata chunk is 1 MB in size, and the compression ratio of the previous ormost recent 1024 data chunks, or previous 1 GB (gigabyte) of datachunks, may be considered to determine the compression ratio to beemployed for the current data chunk in the data stream. However, otherdata chunk sizes and numbers of data chunks may be employed in otherexamples.

The current network throughput associated with the current data streamover the network 150 may also be determined (operation 306). In oneexample, the performance monitor 122 may determine or monitor thenetwork throughput once per uncompressed data chunk at the networkinterface 132 relative to the throughput of the local data storage 130of the data source 110. In this particular embodiment, the performancemonitor 122 may determine the current network throughput based on theemptiness or fullness of a network queue associated with the networkinterface 132, as is described in greater detail below in conjunctionwith FIG. 4.

Continuing with the example of FIG. 3, the current processor utilizationof the data source 110 may also be determined or monitored (operation308) once per data chunk. However, unlike the compression ratio and thecurrent network throughput, which are measured periodically orrepeatedly for each data chunk of each stream, the current processorutilization may be determined periodically or once per chunk across alldata streams, as the one or more processors being utilized are a systemresource utilized by the data compression system 120 to compress each ofthe data streams. As is discussed below in connection with FIG. 5, theperformance monitor 122 may determine the processor utilization bydetermining how many execution threads of a thread “pool” are currentlyactive (e.g., being used). In other examples, the performance monitor122 may determine processor utilization by a number of processes thatare currently being employed.

Based on these determined performance factors, one of the two availablecompression algorithms may then be selected (operations 310-318). Morespecifically, each of the three performance factors may be comparedagainst a corresponding threshold or value. For example, the compressionselection module 124 may determine whether the determined compressionratio of the most recently compressed chunk of the data stream is lessthan a particular threshold (e.g., THRESH_1) (operation 310). If so, thecompression selection module 124 may select the lower compressionalgorithm (e.g., the best speed algorithm) to compress the current,uncompressed data chunk (operation 316) using the compression module126. Otherwise, the compression selection module 124 may determinewhether the current network throughput associated with the data streamexceeds the current throughput of the local data storage 130 (operation312). If so, the compression selection module 124 again may select thelower compression algorithm (e.g., the best speed algorithm) to compressthe current, uncompressed data chunk (operation 316) using thecompression module 126. Otherwise, the compression selection module 124may determine whether the current processor utilization within the datasource 110 exceeds a corresponding threshold (e.g., THRESH_2) (operation314). If so, the compression selection module 124 again may select thelower compression algorithm (e.g., the best speed algorithm) to compressthe current, uncompressed data chunk (operation 316) using thecompression module 126. Otherwise, the compression selection module 124may select the higher compression algorithm (e.g., the best compressionalgorithm) to compress the current, uncompressed data chunk (operation318) using the compression module 126. Consequently, in this specificexample, the best speed compression is employed in response to any oneor more of the performance factors having crossed its correspondingthreshold (in the positive or negative direction, depending on thefactor), thus effectively ORing the three conditions together.

Once the current data chunk is compressed, the data chunk is transmittedover the network 150 via the network interface 132 to the data target160 for storing at the remote data storage 180 (operation 320). Thisprocess may then be repeated for each data chunk of the stream, as wellas for data chunks of other data streams being compressed concurrently.

FIG. 4A is a block diagram of an example network queue 402 that may beemployed in the data source 110 to determine a performance factor for anexample method of dynamic data compression algorithm selection, such asthe method 300 of FIG. 3. As illustrated in FIG. 4A, the networkinterface 132 may include the network queue 402; in other embodiments,the network queue 402 may reside outside the network interface 132, suchas, for example, between the data compression system 120 and the networkinterface 132. Further, the network queue 402 may include a number ofqueue elements or buffers 404, each of which may hold a compressed datachunk of a data stream to be transmitted over the network 150. Inembodiments in which more than one data stream may be compressedconcurrently or in parallel, a separate network queue 402 may beavailable for each of the data streams so that each network queue 402contains data chunks for its corresponding data stream. As shown in FIG.4A, the network queue 402 may be structured as a “first in, first out”(FIFO) buffer, in which compressed data chunks from the data compressionsystem 120 are placed as queue elements or buffers 404 into the networkqueue 402, and the first of the queue elements 404 is then transmittedfirst via the network 150 to the data target 160. In other examples, thenetwork queue 402 may be a circular buffer or some other queue-likecomponent.

To determine the network throughput as a performance factor forselecting between two or more compression algorithms, the performancemonitor 122 of FIG. 1 may monitor the fullness or emptiness of thenetwork queue 402 as an indication or proxy of the network throughputrelative to the throughput of the local data storage 130. For example,the performance monitor 122 may determine the current number orpercentage of the queue elements 404 of the network queue 402 thatcontain a compressed data chunk to be transmitted over the network 150.The compression selection module 124 may then compare that number orpercentage to some threshold and, if less than the threshold (e.g., the“depth” of the queue is below the threshold), the compression selectionmodule 124 may determine that the network throughput is greater than thedata throughput of the local data storage 130 and the data compressionsystem 120, thus warranting use of the best speed compression algorithm.In other words, if the network queue 402 is sufficiently empty (e.g.,the current queue depth is low), the transmission throughput over thenetwork 150 is high compared to the time taken to retrieve theuncompressed data chunks from the local data storage 130 and compressthe retrieved chunks. As a result, the compression selection module 124may thus determine that employing the best speed algorithm wouldexpedite the overall compression and transmission of the data chunks, asthe network 150 may be fast enough to transmit compressed data chunksthat are not maximally compressed without creating a transmissionbottleneck.

As shown in FIG. 4A, the data source 110 may also include an input queue403 including a number of queue elements or buffers 404, with each ofthe buffers 404 including an uncompressed data chunk read from the localdata storage 130 awaiting compression by the data compression system120. In one example, as is described in greater detail below inconjunction with FIGS. 4C and 4D, the buffers 404 for both the inputqueue 403 and the network queue 402 may be allocated from a singlegeneral buffer pool within the data source 110, or from a buffer poolassociated with the particular data stream being compressed.

FIG. 4B is a block diagram of an example network queue 412 andassociated output queue 413 for data processed by the data decompressionsystem 170 of the data target 160. The network queue 412 may configuredto receive each compressed data chunk of a data stream from the datasource 110 via the network 150 into a data buffer 404. The networkinterface 182 may include the network queue 412; in other embodiments,the network queue 412 may reside outside the network interface 182, suchas, for example, between the data decompression system 170 and thenetwork interface 182. The network queue 412 may include a number ofqueue elements or buffers 404, each of which may hold a compressed datachunk of a data stream to be decompressed by the data decompressionsystem 170. In embodiments in which more than one data stream may becompressed concurrently or in parallel, a separate network queue 412 maybe available for each of the data streams so that each network queue 412contains data chunks for its corresponding data stream. As with thenetwork interface 132 of FIG. 4A, the network interface 182 may bestructured as a FIFO queue, circular buffer, or some other buffer orqueue arrangement.

As depicted in FIG. 4B, the data target 160 may also include an outputqueue 413 including a number of queue elements or buffers 404, in whicheach buffer 404 includes an uncompressed data chunk generated by thedata decompression system 170 awaiting storage at the remote datastorage 180. In one embodiment, as is discussed more fully below inconjunction with FIGS. 4E and 4F, the buffers 404 of both the networkqueue 412 and the output queue 413 may be allocated from a singlegeneral buffer pool provided in the data target 160, or from a bufferpool associated with the particular data stream being decompressed.

FIGS. 4C and 4D are a flow diagram of an example method 410 of operatingthe data source 110 of FIGS. 1 and 4A. In the method 400, a buffer 404may be allocated for each of the input queue 403 and the network queue402 (operation 412). In some examples, these two buffers 404 may beallocated at the same time. Also, the buffers 404 may be allocated froma buffer pool specifically associated with the current data stream, orfrom a single buffer pool available for all data streams. In thisexample, if at least two buffers 404 are not available for allocation,the data source 110 will pause the reading of data chunks from the localdata storage 130 until such unallocated buffers 404 are available. Also,an identical identifier may be assigned to each of the two allocatedbuffers 404 (operation 414) so that each uncompressed data chunk of theinput queue 403 may be associated with its corresponding compressed datachunk in the network queue 402, and that the proper order of thecompressed data chunks will be maintained when transmitted from thenetwork queue 402 over the network 150 via the network interface 132 tothe data target 160. In at least some examples, the identifierassociated with each buffer 404 is incremented for each pair of buffers404 allocated.

The next uncompressed data chunk may then be read into the buffer 404allocated for the input queue 403 from the local data storage 130(operation 416). That buffer 404 may then be added to the input queue403 (operation 418) for processing by the compression module 126. Thecompression selection module 124 may select a particular compressionalgorithm (operation 420) (e.g., a best compression algorithm or a bestspeed algorithm) based on the performance information provided via theperformance monitor 122, such as that described above in connection withFIG. 3. To compress the uncompressed data chunk, the thread assignmentmodule 128 may assign or allocate an available execution thread(operation 422) to compress the data chunk using the compression module126 (operation 424), wherein the compressed data is stored in the buffer404 previously allocated for the network queue 402, thus having the sameidentifier as the buffer 404 that holds the uncompressed data for thesame data chunk. The compression module 126 may also associate anindication of the compression algorithm utilized with the compresseddata chunk for use by the data target 160 in decompressing the datachunk. The performance monitor 122 may update the performanceinformation to indicate that a thread has been allocated, thusreflecting processor utilization within the data source 110. Before,during, or after the compression of the current data chunk, theperformance monitor 122 may also update the performance informationusing the identity of the particular compression algorithm utilized forthis data chunk (operation 426), thus affecting the tracking of thecompression ratio, as described above.

After completion of the compression of the current data chunk, thecurrent thread may be de-allocated (operation 428) to allow compressionof a subsequent data chunk using that thread, and the performancemonitor 122 may update the performance information regarding processorutilization accordingly. Also, the buffer 404 previously containing theuncompressed data chunk may be removed from the input queue 403 andde-allocated to the buffer pool (operation 430), and the buffer 404allocated to the network queue 402 that now contains the compressed datachunk may be added to the network queue 402 (operation 432). Moreover,the performance monitor 122 may update performance informationdescribing the relative throughput of the network 150 compared to thethroughput at the local data storage 130 based on the current number ofbuffers 404 in the network queue 402, thus representing the fullness oremptiness of the network queue 402. The network interface 132 maytransmit the compressed data chunk from the buffer 404 via the network150 to the data target 160 when the data chunk identifier associatedwith the buffer 404 matches the next identifier to be transmitted(operation 434) to maintain the proper transmission order of the datachunks. When the compressed data chunk has been transmitted, the datasource 110 may remove the data buffer 404 holding the compressed datachunk from the network queue 402 and de-allocate the buffer 404 to thebuffer pool (operation 436), and the performance monitor 122 may updatethe performance information regarding the relative throughput of thenetwork 150 compared to the throughput at the local data storage 130based on the current number of buffers 404 in the network queue 412.

The data source 110 may repeat operations 412-436 for each uncompresseddata chunk of a data stream to be compressed and transmitted to the datatarget 160. Further, the filling of the input queue 403, the compressionof the data chunks (including the emptying of the input queue 403 andthe filling of the network queue 402) using the available executionthreads, and the emptying of the network queue 402 may each be performedasynchronously of each other.

FIGS. 4E and 4F are a flow diagram of an example method 450 of operatingthe data target 160 of FIGS. 1 and 4B. In the method 450, a buffer 404may be allocated for each of the network queue 412 and the output queue413 (operation 452). These two buffers 404 may be allocated at the sametime, and may be allocated from a buffer pool specifically associatedwith the current data stream, or from a single buffer pool serving alldata streams to be received. In this example, if at least two buffers404 are not available for allocation, the data target 160 will pause thereading of data chunks from the network 150 until such unallocatedbuffers 404 are available. Also, an identical identifier may be assignedto each of the two allocated buffers 404 (operation 454) so that eachcompressed data chunk of the network queue 412 may be associated withits corresponding uncompressed data chunk in the output queue 413, andthat the proper order of the uncompressed data chunks will be maintainedwhen written from the output queue 413 to the remote data storage 180.In at least some examples, the identifier associated with each buffer404 is incremented for each pair of buffers 404 allocated.

The next compressed data chunk may then be read into the buffer 404allocated for the network queue 412 from the network 150 (operation456). That buffer 404 may then be added to the network queue 412(operation 458) for processing by the decompression module 176. To thatend, the decompression module 176 may determine the compressionalgorithm originally employed to compress the data chunk at the datasource 110 using a compression indication accompanying the compresseddata chunk (operation 460). To decompress the compressed data chunk, thethread assignment module 178 may assign or allocate an availableexecution thread (operation 462) to decompress the data chunk using thedecompression module 126 (operation 464), wherein the compressed data isstored in the buffer 404 previously allocated for the output queue 413,thus having the same identifier as the buffer 404 that holds thecompressed data for the same data chunk. The performance monitor 172 mayupdate performance information to indicate that a thread has beenallocated.

After completion of the decompression of the current data chunk, thecurrent thread may be de-allocated (operation 468) to allowdecompression of a subsequent data chunk using that thread, and theperformance monitor 172 may update the performance information toindicate the de-allocation of the thread. Also, the buffer 404previously containing the compressed data chunk may be removed from thenetwork queue 412 and de-allocated to the buffer pool (operation 470),and the buffer 404 allocated to the output queue 413 that now containsthe decompressed data chunk may be added to the output queue 413(operation 472). The data target 160 may store the decompressed datachunk from the buffer 404 to the remote data storage 180 when the datachunk identifier associated with the buffer 404 matches the nextidentifier to be stored (operation 474) to maintain the proper order ofdata chunks in the remote data storage 180. When the decompressed datachunk has been stored, the data target 160 may remove the data buffer404 holding the decompressed data chunk from the output queue 413 andde-allocated to the buffer pool (operation 476).

The data target 160 may repeat operations 452-476 for each compresseddata chunk of a data stream to be decompressed and stored to the remotedata storage 180. Moreover, the filling of the network queue 412, thedecompression of the data chunks (including the emptying of the networkqueue 412 and the filling of the output queue 413) using the availableexecution threads, and the emptying of the output queue 413 may each beperformed asynchronously of each other.

FIG. 5 is a block diagram of an example execution thread pool 500employed in the data source 110 of FIG. 1 to determine a performancefactor for an example method of dynamic data compression algorithmselection, such as the method 300 of FIG. 3. In this particular example,twenty execution threads 501-520 are provided in the thread pool 500,each of which may be employed to perform various tasks within the datasource 110, including the various operations ascribed above to theperformance monitor 122, the compression selection module 124, and thecompression module 126. As depicted in FIG. 5, a current snapshot of thethread pool 500 may reveal that threads 503-505, 510, 511, and 515(presented in dashed outline) are currently being employed for varioustasks, and the threads 501, 502, 506-509, 512-514, and 516-520 arecurrently unused and available for other tasks. While the particularembodiment of FIG. 5 employs twenty threads total, other embodiments mayemploy greater or fewer numbers of threads, which may depend on, forexample, the number of physical or virtual central processing units(CPUs) or cores available in the data source 110 or the data target 160.

In one example, the performance monitor 122 may determine the number orpercentage of the currently unavailable or available threads of thethread pool 500 as a proxy or indication of the current processorutilization of the data source 110, as mentioned above. The compressionselection module 124 may then compare the number or percentage ofthreads to some level or threshold to determine whether the associatedprocessor utilization is high enough to warrant use of the best speedcompression to refrain from further increasing the processor utilizationsuch that overall throughput of the data source 110 would be negativelyimpacted. In other examples, if a pool of separate software processes isprovided in the data source 110, the performance monitor 122 maydetermine the number of current software processes as a proxy for thecurrent processor utilization.

With respect to the thread assignment module 128, FIG. 6 is a blockdiagram of multiple available threads 501, 502, 506, and 507 assigned tocompress source data 601 of a single data stream (e.g., STREAM 1) fortransmission as compressed target data 603 for the single data streamover a high-throughput network connection 605 via the network 150. Inthis example, the network throughput of the connection 605 is high(e.g., as indicated by way of an empty or near-empty network queue, suchas the network queue 402 of FIG. 4). Consequently, the thread assignmentmodule 128 has allocated or assigned a relatively high number of threads(e.g., four threads 501, 502, 506, and 507) out of the total number ofthreads available in the thread pool 500 to perform compression andassociated operations of the performance monitor 122, the compressionselection module 124, and the compression module 126 discussed above toexpedite the compression of the data chunks of the STREAM 1 source data601 to utilize the high-throughput network connection 605 to greatereffect, as the use of the additional threads may not cause the networkqueue 402 to be filled completely. Such use of additional threads, inconjunction with the compression selection module 124 possibly employingthe best speed compression in response to the high-throughput networkconnection 605, as described above, may further expedite the compressionof the STREAM 1 source data 601.

Conversely, FIG. 7 is a block diagram of multiple threads assigned tocompress the source data 701 of a single data stream (e.g., STREAM 1)for transmission as compressed target data 703 for the single datastream over a low-throughput network connection 705 via the network 150.In this situation, in response to the low-throughput nature of thenetwork connection 705 (e.g., a full or near-full network queue, such asthe network queue 402 of FIG. 4), the thread assignment module 128 mayassign a relatively low number of threads (e.g., two threads 501 and502) to perform the monitoring, algorithm selection, and compressionfunctions for the STREAM 1 source data 701, as the network queue 402 maybe full in response to fewer threads being employed. In addition, thecompression selection module 124, in reaction to the low-throughputnature of the network connection 705, may also employ the assignedthreads 501 and 502 to perform the best compression algorithm to reducethe size of the STREAM 1 target data 703 to be transported to the datatarget 160 via the low-throughput network connection 705.

In further examples, the thread assignment module 128 may assign threadsfor the concurrent compression of multiple data streams based on thenumber of available threads in the thread pool 500, as well as inresponse to the level of throughput corresponding to the networkconnection associated with each data stream. For example, FIG. 8 is ablock diagram of multiple threads assigned to compress the source data801, 802 of two data streams (e.g., STREAM 1 and STREAM 2) fortransmission over two high-throughput network connections 803, 804. Inthis example, the thread assignment module 128 may assign four threads(e.g., threads 501, 502, 506, and 507) to compress the two data streamsif the network queues 402 are not being filled sufficiently orcompletely. Moreover, if the STREAM 1 target data 803 and the STREAM 2target data 804 currently are being transmitted over high-throughputnetwork connections 805 and 807, respectively, the thread assignmentmodule 128 may evenly assign the threads 501, 502, 506, and 507 to thetwo data streams as a result of neither network queue 402 associatedwith each data stream becoming full. Oppositely, if the networkconnections associated with each of the STREAM 1 target data 803 and theSTREAM 2 target data 804 currently exhibit low throughput, the threadassignment module 128 may assign an equal, but overall fewer, number ofthreads (e.g., two threads 501 and 502) to the two data streams due tothe network queue 402 of each data stream remaining nearly or completelyfull, thus allowing the remaining threads to perform other functionswithin the data source 110. Additionally, the compression selectionmodule 124 may determine that the high-throughput nature of the networkconnections 805, 807 warrants use of the best speed algorithm for boththe STREAM 1 source data 801 and the STREAM 2 source data 802 to takegreater advantage of the available bandwidth of the network connections805, 807.

FIG. 9 is a block diagram of multiple threads assigned to compress thesource data 901, 902 of a first data stream (e.g., STREAM 1) and asecond data stream (e.g., STREAM 2) for transmission over ahigh-throughput network connection 905 and a low-throughput networkconnection 907, respectively. In this example, the thread assignmentmodule 128 determines that four threads (e.g., threads 501, 502, 506,and 507) are available to be assigned to compress the two data streams.In response to the STREAM 1 target data 903 and the STREAM 2 target data904 currently being transmitted over a high-throughput networkconnection 905 and a low-throughput network connection 907,respectively, the thread assignment module 128 may assign a greaternumber of threads (e.g., three threads 501, 502, and 506) to the STREAM1 target data 903 and a fewer number of threads (e.g., one thread 507)to the STREAM 2 target data 904 to take greater advantage of theadditional throughput available via the network connection 905 whilesimultaneously reducing the bandwidth of the low-throughput networkconnection 907 consumed by the STREAM 2 target data 904 based on thefullness level of each of the network queues 402 associated with the twodata streams. Moreover, the compression selection module 124 maydetermine that the best speed algorithm be employed to compress theSTREAM 1 source data 901, and that the best compression algorithm beutilized to compress the STREAM 2 source data 902 in light of themeasured throughputs of their corresponding network connections 905,907, thus causing the amount of data included in the STREAM 1 targetdata 903 and the STREAM 2 target data 904 to comport with theircorresponding connections 905, 907. As a result, the compressionselection module 124 may employ different compression algorithms todifferent data streams that are being compressed in parallel.

In other examples, the thread assignment module 178 of the data target160 may cause the decompression of the compressed data chunks usingmultiple execution threads based on the fullness or emptiness of thenetwork queue 412 associated with each data stream in a correspondingmanner to that described above in conjunction with FIGS. 6-9. Morespecifically, a fuller network queue 412 may result in more threadsbeing assigned to decompress data chunks for the corresponding datastream, while an emptier network queue 412 may result in fewer threadsbeing assigned to decompress the data chunks of that queue 412.

FIG. 10 is a block diagram illustrating an example of a computing deviceor computer system 1000 which may be used to implement the embodimentsdisclosed above, such as the data source 110 and the data target 160 ofFIG. 1. Embodiments disclosed herein include various operations thatmaybe performed by hardware modules or components, or hardware modulesor components used in combination with software instructions. Moreover,as described herein, in some embodiments, a first module or componentmay be hardware that is programmed by one set of software or firmwareinstructions to perform one or more functions, while a second module orcomponent may be that same hardware that is programmed by another set ofsoftware or firmware instructions to perform one or more otherfunctions. As a result, the same hardware may represent the first moduleduring one period of time, and may represent the second module duringthe same time or a second period of time. According to one example, thecomputing device or system 1000 may include at least one processor 1002,at least one system interface 1004, at least one memory 1006, at leastone storage device 1008, and at least one I/O device 1010. The system1000 may further include at least one processor bus 1012 and/or at leastone input/output (I/O) bus 1014.

The processor 1002 may include one or more internal levels of cache (notshown in FIG. 10) and can be any known processor, such as amicroprocessor, microcontroller, digital signal processor, graphicsprocessor, or the like. The processor bus 1012, also possibly known as ahost bus or a front side bus, may be used to couple the processor 1002with the system interface 1004. The system interface 1004 may beconnected to the processor bus 1012 to interface various components ofthe system with the processor 1002. System interface 1004 may, forexample, include a bus controller 1016 or bus interface unit to directinteraction with the processor bus 1012 and a memory controller 1018 forinterfacing the memory 1006 with the processor bus 1012. The systeminterface 1004 may also include an I/O interface 1020 to interface oneor more I/O devices 1010 with the processor 1002.

The memory 1006 may include one or more memory cards and controlcircuits (not depicted in FIG. 10). The memory 1006 may include a mainmemory 1006A and/or a read-only memory (ROM) 1006B. The main memory1006A can be random access memory (RAM) or any other dynamic storagedevice(s) for storing information and instructions to be executed by theprocessor 1002. Main memory 1006A may be used for storing temporaryvariables or other intermediate information during execution ofinstructions by the processor 1002. The read-only memory 1006B can beany static storage device(s), such as Programmable Read Only Memory(PROM) chip for storing static information and instructions for theprocessor.

According to one embodiment, the above methods may be performed by thecomputer system 1000 in response to the processor 1002 executing one ormore sequences of one or more instructions contained in the main memory1006A. These instructions may be read into main memory 1006A fromanother machine-readable medium capable of storing or transmittinginformation in a form (e.g., software, processing application) readableby a machine (e.g., a computer). Execution of the sequences ofinstructions contained in the main memory 1006A may cause the processor1002 to perform the process operations described herein.

A machine-readable media may take the form of, but is not limited to,non-volatile media and volatile media. Non-volatile media may include amass storage device 1008 and volatile media may include dynamic storagedevices. Common forms of machine-readable media may include, but are notlimited to, magnetic storage media (e.g. hard disk drive); opticalstorage media (e.g. Compact Disc Read-Only Memory (CD-ROM) and DigitalVersatile Disc Read-Only Memory (DVD-ROM)), magneto-optical storagemedia; read-only memory (ROM); random access memory (RAM, such as staticRAM (SRAM) and dynamic RAM (DRAM)); erasable programmable memory (e.g.,erasable programmable read-only memory (EPROM) and electrically erasableprogrammable read-only memory (EEPROM)); flash memory; or other types ofmedia suitable for storing computer or processor instructions.

Embodiments disclosed herein include various operations that aredescribed in this specification. As discussed above, the operations maybe performed by hardware components and/or may be embodied inmachine-executable instructions, which may be used to cause ageneral-purpose or special-purpose processor programmed with theinstructions to perform the operations. Alternatively, the operationsmay be performed by a combination of hardware, software, and/orfirmware.

The performance of one or more operations described herein may bedistributed among one or more processors, not only residing within asingle machine, but deployed across a number of machines. In someexamples, the one or more processors or processor-implemented modulesmay be located in a single geographic location (e.g., within a homeenvironment, an office environment, or a server farm). In otherembodiments, the one or more processors or processor-implemented modulesmay be distributed across a number of geographic locations.

As used herein, the term “or” may be construed in either an inclusive orexclusive sense. Moreover, plural instances may be provided forresources, operations, or structures described herein as a singleinstance. Additionally, boundaries between various resources,operations, modules, engines, and data stores may be arbitrary, andparticular operations are illustrated in a context of specificillustrative configurations. In general, structures and functionalitypresented as separate resources in the examples configurations may beimplemented as a combined structure or resource. Similarly, structuresand functionality presented as a single resource may be implemented asseparate resources.

While the present disclosure has been described with reference tovarious embodiments, these embodiments are illustrative, and the scopeof the disclosure is not limited to such embodiments. Variousmodifications and additions can be made to the exemplary embodimentsdiscussed herein without departing from the scope of the disclosure. Forexample, while the embodiments described above refer to particularfeatures, the scope of this disclosure also includes embodiments havingdifferent combinations of features, as well as embodiments that do notinclude all of the described features. Accordingly, the scope of thedisclosure is intended to embrace all such alternatives, modifications,and variations, together with all equivalents thereof.

1. A method for data compression, the method comprising: receivinguncompressed source data at a data compression system from a datastorage device, the uncompressed source data comprising a plurality ofuncompressed data chunks; selecting, at a first time, a firstcompression technique from a plurality of compression techniques to useto compress one or more first uncompressed data chunks of the pluralityof uncompressed data chunks; compressing one or more first uncompresseddata chunks using the first compression technique to produce one or morefirst compressed data chunks; routing the one or more first compresseddata chunks to a data target over a network; at each second time of oneor more second times: identifying, utilizing a hardware processor of thedata compression system, at least one performance factor, the at leastone performance factor characterizing a performance of the datacompression system, of the network, or of the data target; selecting acompression technique from the plurality of compression techniques basedon the identified at least one performance factor, wherein, for each ofat least one second time of the one or more second times, thecompression technique is a second compression technique that isdifferent than the first compression technique; compressing, utilizingthe data compression system, one or more next uncompressed data chunksof the plurality of uncompressed data chunks using the selectedcompression algorithm to produce one or more next compressed datachunks; and routing the one or more next compressed data chunks to thedata target over the network.
 2. The method for data compression asrecited in claim 1, wherein selecting the compression techniqueincludes: selecting a compression algorithm to use to compress the oneor more next uncompressed data chunks; selecting a value or parameterwith which to configure a compression algorithm to use to compress theone or more next uncompressed data chunks; or selecting a portion of acompression algorithm to use to compress the one or more nextuncompressed data chunks.
 3. The method for data compression as recitedin claim 1, wherein the one or more second times include a plurality ofsecond times, and wherein consecutive second times within the pluralityof second times are separated by a defined time interval.
 4. The methodfor data compression as recited in claim 1, wherein the one or moresecond times include a plurality of second times, and wherein theplurality of second times are defined to correspond to a compressiontime for each of multiple sets of uncompressed data chunks in theplurality of uncompressed data chunks.
 5. The method for datacompression as recited in claim 1, wherein the one or more second timesinclude a plurality of second times, and wherein the plurality of secondtimes are defined to correspond to a compression time for eachuncompressed data chunk subsequent to the first uncompressed data chunkin the plurality of uncompressed data chunks.
 6. The method for datacompression as recited in claim 1, wherein a first data stream includesthe plurality of uncompressed data chunks and a second data streamincludes a plurality of second uncompressed data chunks, and wherein themethod further comprises: identifying at least one other performancefactor, the at least one other performance factor characterizing aperformance corresponding to processing of the second data stream;selecting an other-stream compression technique from the plurality ofcompression techniques based on the identified at least one otherperformance factor; compressing, utilizing the data compression system,a second uncompressed data chunk of the plurality of second uncompresseddata chunks using the selected other-stream compression algorithm toproduce a second compressed data chunks; and routing the secondcompressed data chunks to an other-stream data target over the network,wherein the second uncompressed data chunk is compressed concurrentlywith a next uncompressed data chunk of the plurality of uncompresseddata chunk, and wherein the selection of the other-stream compressiontechnique is performed independently of the selection of the compressiontechnique used to compress the next uncompressed data chunk.
 7. Themethod for data compression as recited in claim 1, further comprising,at each second time of one or more second times: communicating anindication of the selected compression technique used to compress theone or more next compressed data chunks to the data target.
 8. Themethod for data compression as recited in claim 1, wherein identifyingthe at least one performance factor includes assessing: a queue ofcompressed data chunks awaiting transmission over the network to thedata target; a network throughput associated with the network; aprocessor utilization of the data compression system; or a number ofactive execution threads in the data compression system.
 9. The methodfor data compression as recited in claim 1, wherein the firstcompression technique is associated with a first expected compressionratio that is different than a second expected compression ratioassociated with the second compression technique.
 10. A computer-programproduct tangibly embodied in a non-transitory machine-readable storagemedium, including instructions configured to cause one or more dataprocessors to perform actions including: receiving uncompressed sourcedata at a data compression system from a data storage device, theuncompressed source data comprising a plurality of uncompressed datachunks; selecting, at a first time, a first compression technique from aplurality of compression techniques to use to compress one or more firstuncompressed data chunks of the plurality of uncompressed data chunks;compressing one or more first uncompressed data chunks using the firstcompression technique to produce one or more first compressed datachunks; routing the one or more first compressed data chunks to a datatarget over a network; at each second time of one or more second times:identifying, utilizing a hardware processor of the data compressionsystem, at least one performance factor, the at least one performancefactor characterizing a performance of the data compression system, ofthe network, or of the data target; selecting a compression techniquefrom the plurality of compression techniques based on the identified atleast one performance factor, wherein, for each of at least one secondtime of the one or more second times, the compression technique is asecond compression technique that is different than the firstcompression technique; compressing, utilizing the data compressionsystem, one or more next uncompressed data chunks of the plurality ofuncompressed data chunks using the selected compression algorithm toproduce one or more next compressed data chunks; and routing the one ormore next compressed data chunks to the data target over the network.11. The computer-program product as recited in claim 10, whereinselecting the compression technique includes: selecting a compressionalgorithm to use to compress the one or more next uncompressed datachunks; selecting a value or parameter with which to configure acompression algorithm to use to compress the one or more nextuncompressed data chunks; or selecting a portion of a compressionalgorithm to use to compress the one or more next uncompressed datachunks.
 12. The computer-program product as recited in claim 10, whereinthe one or more second times include a plurality of second times, andwherein consecutive second times within the plurality of second timesare separated by a defined time interval.
 13. The computer-programproduct as recited in claim 10, wherein the one or more second timesinclude a plurality of second times, and wherein the plurality of secondtimes are defined to correspond to a compression time for each ofmultiple sets of uncompressed data chunks in the plurality ofuncompressed data chunks.
 14. The computer-program product as recited inclaim 10, wherein the one or more second times include a plurality ofsecond times, and wherein the plurality of second times are defined tocorrespond to a compression time for each uncompressed data chunksubsequent to the first uncompressed data chunk in the plurality ofuncompressed data chunks.
 15. The computer-program product as recited inclaim 10, wherein a first data stream includes the plurality ofuncompressed data chunks and a second data stream includes a pluralityof second uncompressed data chunks, and wherein the actions furtherinclude: identifying at least one other performance factor, the at leastone other performance factor characterizing a performance correspondingto processing of the second data stream; selecting an other-streamcompression technique from the plurality of compression techniques basedon the identified at least one other performance factor; compressing,utilizing the data compression system, a second uncompressed data chunkof the plurality of second uncompressed data chunks using the selectedother-stream compression algorithm to produce a second compressed datachunks; and routing the second compressed data chunks to an other-streamdata target over the network, wherein the second uncompressed data chunkis compressed concurrently with a next uncompressed data chunk of theplurality of uncompressed data chunk, and wherein the selection of theother-stream compression technique is performed independently of theselection of the compression technique used to compress the nextuncompressed data chunk.
 16. The computer-program product as recited inclaim 10, wherein the actions further include, at each second time ofone or more second times: communicating an indication of the selectedcompression technique used to compress the one or more next compresseddata chunks to the data target.
 17. The computer-program product asrecited in claim 10, wherein identifying the at least one performancefactor includes assessing: a queue of compressed data chunks awaitingtransmission over the network to the data target; a network throughputassociated with the network; a processor utilization of the datacompression system; or a number of active execution threads in the datacompression system.
 18. The computer-program product as recited in claim10, wherein the first compression technique is associated with a firstexpected compression ratio that is different than a second expectedcompression ratio associated with the second compression technique. 19.A system for data compression: one or more data processors; and anon-transitory computer readable storage medium containing instructionswhich when executed on the one or more data processors, cause the one ormore data processors to perform actions including: receivinguncompressed source data at a data compression system from a datastorage device, the uncompressed source data comprising a plurality ofuncompressed data chunks; selecting, at a first time, a firstcompression technique from a plurality of compression techniques to useto compress one or more first uncompressed data chunks of the pluralityof uncompressed data chunks; compressing one or more first uncompresseddata chunks using the first compression technique to produce one or morefirst compressed data chunks; routing the one or more first compresseddata chunks to a data target over a network; at each second time of oneor more second times: identifying, utilizing a hardware processor of thedata compression system, at least one performance factor, the at leastone performance factor characterizing a performance of the datacompression system, of the network, or of the data target; selecting acompression technique from the plurality of compression techniques basedon the identified at least one performance factor, wherein, for each ofat least one second time of the one or more second times, thecompression technique is a second compression technique that isdifferent than the first compression technique; compressing, utilizingthe data compression system, one or more next uncompressed data chunksof the plurality of uncompressed data chunks using the selectedcompression algorithm to produce one or more next compressed datachunks; and routing the one or more next compressed data chunks to thedata target over the network.
 20. The system for data compression asrecited in claim 19, wherein selecting the compression techniqueincludes: selecting a compression algorithm to use to compress the oneor more next uncompressed data chunks; selecting a value or parameterwith which to configure a compression algorithm to use to compress theone or more next uncompressed data chunks; or selecting a portion of acompression algorithm to use to compress the one or more nextuncompressed data chunks.